Probabilistic resource pooling games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Opinion Pooling

How can several individuals’opinions on some factual matters be aggregated into uni…ed collective opinions? This question arises in many contexts. A panel of climate experts may have to aggregate the panelists’con‡icting opinions into a compromise view, in order to deliver a report to the government. A jury may have to arrive at a collective opinion on the facts of a case, despite disagreements...

متن کامل

Probabilistic opinion pooling generalized Part two: Premise-based opinion pooling

We consider the classical problem of aggregating di¤erent individuals’probability assignments (opinions) over a -algebra of events. In practice, some events represent basic propositions, such as ‘it rains’or ‘CO2 emissions cause global warming’, while others represent combinations thereof, for instance disjunctions (unions) of basic events. It is plausible to treat the basic events as premises ...

متن کامل

Probabilistic Games

Assume we have the following game. A verifier V interacts with two provers P1 and P2. The verifier is probabilistic and acts honestly according to its (known) strategy. The goal of the provers is to convince the verifier of a certain fact. The provers may collaborate to set up a strategy to maximize their chances of success. However, they are not allowed to exchange information once they receiv...

متن کامل

Probabilistic Quantifiers and Games

We consider inclusion relations among a multitude of classical complexity classes and classes with probabilistic components. A key tool is a method for characterizing such classes in terms of the ordinary quantifiers 3 and V together with a quantifier 3+, which means roughly “for most,” applied to polynomial-time predicates. This approach yields a uniform treatment which leads to easier proofs ...

متن کامل

Probabilistic Robust Timed Games

Solving games played on timed automata is a well-known problem and has led to tools and industrial case studies. In these games, the first player (Controller) chooses delays and actions and the second player (Perturbator) resolves the non-determinism of actions. However, the model of timed automata suffers from mathematical idealizations such as infinite precision of clocks and instantaneous sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Naval Research Logistics (NRL)

سال: 2017

ISSN: 0894-069X

DOI: 10.1002/nav.21776